An Integrated Scheduling Algorithm Based on a Process End Time-Driven and Long-Time Scheduling Strategy

The integrated scheduling problem is a classical combinatorial optimization problem. existing algorithms generally adopt the short-time strategy that does not fully consider impact of degree process parallelism on results. In order to further optimize total processing time product and utilization rate device, an algorithm based end time-driven long-time proposed. proposed sets up separate candidate queue for each device determines premise satisfying constraint conditions tree. Driven by time, finds schedulable processes device. If unique, it scheduled. Otherwise, if with long-path particular, strategies queues different devices are symmetric, relationships between in asymmetric. case analysis results show better than some terms average devices. Therefore, provides new idea single complex product.